Consistency Checking of Natural Language Temporal Requirements using Answer-Set Programming
نویسنده
چکیده
OF DISSERTATION Consistency Checking of Natural Language Temporal Requirements using Answer-Set Programming Successful software engineering practice requires high quality requirements. Inconsistency is one of the main requirement issues that may prevent software projects from being success. This is particularly onerous when the requirements concern temporal constraints. Manual checking whether temporal requirements are consistent is tedious and error prone when the number of requirements is large. This dissertation addresses the problem of identifying inconsistencies in temporal requirements expressed as natural language text. The goal of this research is to create an efficient, partially automated, approach for checking temporal consistency of natural language requirements and to minimize analysts’ workload. The key contributions of this dissertation are as follows: (1) Development of a partially automated approach for checking temporal consistency of natural language requirements. (2) Creation of a formal language Temporal Action Language (TeAL), which provide a means to represent natural language requirements precisely and unambiguously. (3) Development of a front end to semi-automatically translate natural language requirements into TeAL. (4) Development of a translator from TeAL to the ASP language. Validation results to date show that the front end tool makes the task of translating natural language requirements into TeAL more accurate and efficient, and the translator generates ASP programs that correctly detect the inconsistencies in the requirements.
منابع مشابه
Temporal Action Language (TAL): A Controlled Language for Consistency Checking of Natural Language Temporal Requirements
We introduce Temporal Action Language (TAL). We design TAL as a key component of our approach that aims to semi-automate the process of consistency checking of natural language temporal requirements. Analysts can use TAL to express temporal requirements precisely and unambiguously. We describe the syntax and semantics of TAL and illustrate how to use TAL to represent temporal requirements.
متن کاملAnswer-Set Programming in Requirements Engineering
[Context and motivation] Requirements form the foundation of software systems. The quality of the requirements influences the quality of the developed software. [Question/problem] One of the main requirement issues is inconsistency, particularly onerous when the requirements concern temporal constraints. Manual checking whether temporal requirements are consistent is tedious and error prone and...
متن کاملTemporal Action Language (TAL): A Controlled Language for Consistency Checking of Natural Language Temporal Requirements - (Preliminary Results)
متن کامل
Reasoning about Actions with Temporal Answer Sets
In this paper we define a Temporal Action Theory through a combination of Answer Set Programming and Dynamic Linear Time Temporal Logic (DLTL). DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. In our language, general temporal constraints can be included in domain descriptions. We defi...
متن کاملModel Checking Abstract State Machines with Answer Set Programming
Answer Set Programming (ASP) is a logic programming paradigm that has been shown as a useful tool in various application areas due to its expressive modelling language. These application areas include Bourided Model Checking (BMC). BMC is a verification technique that is recognized for its strong ability of finding errors in computer systems. To apply BMC, a system needs to be modelled in a for...
متن کامل